Mediator-assisted multi-source routing in information-centric networks

Among the new communication paradigms recently proposed, information-centric networking (ICN) is able to natively support content awareness at the network layer shifting the focus from hosts (as in traditional IP networks) to information objects. In this paper, we exploit the intrinsic content-awareness ICN features to design a novel multi-source routing mechanism. It involves a new network entity, the ICN mediator, responsible for locating and delivering the requested information objects that are chunked and stored at different locations. Our approach imposes very limited signalling overhead, especially for large chunk size (MBytes). Simulations show significant latency reduction compared to traditional routing approaches

Geometric polarimetry - part II: the Antenna Height Spinor and the Bistatic Scattering Matrix

This paper completes the fundamental development of the basic coherent entities in Radar Polarimetry for coherent reciprocal scattering involving polarized wave states, antenna states and scattering matrices. The concept of antenna polarization states as contravariant spinors is validated from fundamental principles in terms of Schelkunoff's reaction theorem and the Lorentz reciprocity theorem. In the general bistatic case polarization states of different wavevectors must be related by the linear scattering matrix. It is shown that the relationship can be expressed geometrically, and that each scattering matrix has a unique complex scalar invariant characterising a homographic mapping relating pairs of transmit/receive states for which the scattering amplitude vanishes. We show how the scalar invariant is related to the properties of the bistatic Huynen fork in both its conventional form and according to a new definition. Results are presented illustrating the invariant k for a range of spheroidal Rayleigh scatterers

Scalable bloom-filter based content dissemination in community networks using information centric principles

Information-Centric Networking (ICN) is a new communication paradigm that shifts the focus from content location to content objects themselves. Users request the content by its name or some other form of identifier. Then, the network is responsible for locating the requested content and sending it to the users. Despite a large number of works on ICN in recent years, the problem of scalability of ICN systems has not been studied and addressed adequately. This is especially true when considering real-world deployments and the so-called alternative networks such as community networks. In this work, we explore the applicability of ICN principles in the challenging and unpredictable environments of community networks. In particular, we focus on stateless content dissemination based on Bloom filters (BFs). We highlight the scalability limitations of the classical single-stage BF based approach and argue that by enabling multiple BF stages would lead to performance enhancements. That is, a multi-stage BF based content dissemination mechanism could support large network topologies with heterogeneous traffic and diverse channel conditions. In addition to scalability improvements, this approach also is more secure with regard to Denial of Service attacks

Yes-no Bloom filter: A way of representing sets with fewer false positives

The Bloom filter (BF) is a space efficient randomized data structure particularly suitable to represent a set supporting approximate membership queries. BFs have been extensively used in many applications especially in networking due to their simplicity and flexibility. The performances of BFs mainly depends on query overhead, space requirements and false positives. The aim of this paper is to focus on false positives. Inspired by the recent application of the BF in a novel multicast forwarding fabric for information centric networks, this paper proposes the yes-no BF, a new way of representing a set, based on the BF, but with significantly lower false positives and no false negatives. Although it requires slightly more processing at the stage of its formation, it offers the same processing requirements for membership queries as the BF. After introducing the yes-no BF, we show through simulations, that it has better false positive performance than the BF

Discrete numerical approach to the Fredholm Integral Method for evaluating scattering by irregular dielectric particles

A new approach to the implementation of the Fredholm Integral Method (FIM) was developed to evaluate scattering by irregular dielectric particles. In this study, particles are modelled discretizing their volume with cells according to their weighted contents. The approach to FIM presented in this paper represents a departure from earlier work where the numerical integration is no longer based on expansion in a set of polynomials but on direct spatial integration. This approach which still involves contour integration method uses quandrantal contour in combination with a conditioning weighting function to control the magnitude of the integrand due to the power of the radial variable in the integrand being odd. The strength of our approach lies on the fact that computations are performed in the spatial frequency domain. As a result, the angular scattering pattern is strongly connected to the Spatial Fourier Transform of the scatterer; hence, for electrically small particles the angular spectrum is relatively smooth and the number of pivots required for integration is relatively low. This technique is well suited for scattering from irregular inhomogeneous dielectric particles since only the distribution in space of the dielectric constants needs to be defined. Numerical results also confirm the inadequacy of effective medium theories in evaluating scattering characteristics of inhomogeneous particles

Optimized hash for network path encoding with minimized false positives

The Bloom filter is a space efficient randomized data structure for representing a set and supporting membership queries. Bloom filters intrinsically allow false positives. However, the space savings they offer outweigh the disadvantage if the false positive rates are kept sufficiently low. Inspired by the recent application of the Bloom filter in a novel multicast forwarding fabric, this paper proposes a variant of the Bloom filter, the optihash. The optihash introduces an optimization for the false positive rate at the stage of Bloom filter formation using the same amount of space at the cost of slightly more processing than the classic Bloom filter. Often Bloom filters are used in situations where a fixed amount of space is a primary constraint. We present the optihash as a good alternative to Bloom filters since the amount of space is the same and the improvements in false positives can justify the additional processing. Specifically, we show via simulations and numerical analysis that using the optihash the false positives occurrences can be reduced and controlled at a cost of small additional processing. The simulations are carried out for in-packet forwarding. In this framework, the Bloom filter is used as a compact link/route identifier and it is placed in the packet header to encode the route. At each node, the Bloom filter is queried for membership in order to make forwarding decisions. A false positive in the forwarding decision is translated into packets forwarded along an unintended outgoing link. By using the optihash, false positives can be reduced. The optimization processing is carried out in an entity termed the Topology Manger which is part of the control plane of the multicast forwarding fabric. This processing is only carried out on a per-session basis, not for every packet. The aim of this paper is to present the optihash and evaluate its false positive performances via simulations in order to measure the influence of different parameters on the false positive rate. The false positive rate for the optihash is then compared with the false positive probability of the classic Bloom filter

Datasets related to in-land water for limnology and remote sensing applications: distance-to-land, distance-to-water, water-body identifier and lake-centre co-ordinates

Datasets containing information to locate and identify water bodies have been generated from data locating static-water-bodies with resolution of about 300 m (1/360 deg) recently released by the Land Cover Climate Change Initiative (LC CCI) of the European Space Agency. The LC CCI water-bodies dataset has been obtained from multi-temporal metrics based on time series of the backscattered intensity recorded by ASAR on Envisat between 2005 and 2010. The new derived datasets provide coherently: distance to land, distance to water, water-body identifiers and lake-centre locations. The water-body identifier dataset locates the water bodies assigning the identifiers of the Global Lakes and Wetlands Database (GLWD), and lake centres are defined for in-land waters for which GLWD IDs were determined. The new datasets therefore link recent lake/reservoir/wetlands extent to the GLWD, together with a set of coordinates which locates unambiguously the water bodies in the database. Information on distance-to-land for each water cell and the distance-to-water for each land cell has many potential applications in remote sensing, where the applicability of geophysical retrieval algorithms may be affected by the presence of water or land within a satellite field of view (image pixel). During the generation and validation of the datasets some limitations of the GLWD database and of the LC CCI water-bodies mask have been found. Some examples of the inaccuracies/limitations are presented and discussed. Temporal change in water-body extent is common. Future versions of the LC CCI dataset are planned to represent temporal variation, and this will permit these derived datasets to be updated

Geometrical representation of a monochromatic electromagnetic wave using the tangential vector approach, Journal of Telecommunications and Information Technology, 2001, nr 4

The aim of this work is to develop a coherent polarimetric model and to find a geometrical description of a monochromatic wave. The spinor form of the electrical field, its links to the coherency matrix and the Poincare’ sphere are introduced with the aim to obtain a geometrical representation of the spinor. It consists, from the “polarization point of view”, on the polarization vector and a tangential plane to the Poincare’ sphere where it is possible to visualize the zero phase